Reachability Problems in Entity-Relationship Schema Instances
نویسنده
چکیده
Recent developments in reification of ER schemata include automatic generation of webbased database administration systems [1,2]. These systems enforce the schema cardinality constraints, but, beyond unsatisfiable schemata, this feature may create unreachable instances. We prove sound and complete characterisations of schemata whose instances satisfy suitable reachability properties; these theorems translate into linear algorithms that can be used to prevent the administrator from reifying schemata with unreachable instances.
منابع مشابه
Resolving the "Weak Status" of Weak Entity Types in Entity-Relationships Schemas
Entity Relationship schemas include weak entity types, whose entities are identified by their inter-relationships to other entities. During the translation of the EER schema into a logical database schema, the weak entity types are either translated into logical units of the database (a relation or a class), or are embedded as attributes of other logical units. Formal studies of EER schemas eit...
متن کاملA Formalisation of Semantic Schema
| Several methodologies for the semantic integration of databases have been proposed in the literature. These often use a variant of the Entity-Relationship (ER) model as the common data model. To aid the schema conforming, merging and restructuring phases of the semantic integration process, various transformations have been deened that map between ER representations which are in some sense eq...
متن کاملA Formalisation of Semantic Schema Integration
Several methodologies for the semantic integration of databases have been proposed in the literature. These often use a variant of the Entity-Relationship (ER) model as the common data model. To aid the schema conforming, merging and restructuring phases of the semantic integration process, various transformations have been deened that map between ER representations which are in some sense equi...
متن کاملTeaching a Schema Translator to Produce O/R Views
This paper describes a rule-based algorithm to derive a relational schema from an extended entity-relationship model. Our work is based on an approach by Atzeni and Torlone in which the source EER model is imported into a universal metamodel, a series of transformations are performed to eliminate constructs not appearing in the relational metamodel, and the result is exported. Our algorithm inc...
متن کاملDescription Logics for Modeling Dynamic Information
In the first part of this Chapter we will introduce a general temporally enhanced conceptual data model able to represent time varying data, in the spirit of a temporally enhanced Entity-Relationship data model. In the second part, we will introduce an object-oriented conceptual data model enriched with schema change operators, which are able to represent the explicit temporal evolution of the ...
متن کامل